Degree Constrained Node-Connectivity Problems
نویسندگان
چکیده
منابع مشابه
Approximating node-connectivity and prize-collecting network-design problems with degree constraints
Motivated by applications to designing peer-to-peer overlays for distributing live streaming media content, we study a variety of network design problems with degree constraints on the nodes. We first consider the problem of finding a 2-node-connected spanning subgraph with degree constraints. Node-connectivity problems with degree constraints present new challenges as compared to their edge co...
متن کاملStructure Learning Constrained by Node-Specific Degree Distribution
We consider the problem of learning the structure of a Markov Random Field (MRF) when a node-specific degree distribution is provided. The problem setting is inspired by protein contact map (i.e., graph) prediction in which the contact number (i.e., degree) of an individual residue (i.e., node) can be predicted without knowing the contact graph. We formulate this problem using maximum pseudo-li...
متن کاملApproximation Algorithms for Constrained Node Weighted Steiner Tree Problems
We consider a class of optimization problems, where the input is an undirected graph with two weight functions dened for each node, namely the node's pro t and its cost. The goal is to nd a connected set of nodes of low cost and high pro t. We present approximation algorithms for three natural optimization criteria that arise in this context, all of which are NP-hard. The budget problem asks fo...
متن کاملThe parameterized complexity of degree constrained editing problems
Luke Mathieson – The Parameterized Complexity of Degree Constrained Editing Problems This thesis examines degree constrained editing problems within the framework of parameterized complexity. A degree constrained editing problem takes as input a graph and a set of constraints and asks whether the graph can be altered in at most k editing steps such that the degrees of the remaining vertices are...
متن کاملLinear Time Approximation Algorithms for Degree Constrained Subgraph Problems
Many real-world problems require graphs of such large size that polynomial time algorithms are too costly as soon as their runtime is superlinear. Examples include problems in VLSI-design or problems in bioinformatics. For such problems the question arises: What is the best solution that can be obtained in linear time? We survey linear time approximation algorithms for some classical problems f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2013
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-013-9849-1